Complexity in Prefix-Free Regular Languages
نویسندگان
چکیده
We examine deterministic and nondeterministic state complexities of regular operations on prefixfree languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next provide the tight bounds on state complexity of symmetric difference, and deterministic and nondeterministic state complexity of difference and cyclic shift of prefix-free languages.
منابع مشابه
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...
متن کاملSyntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We...
متن کاملState Complexity of Prefix-Free Regular Languages
We investigate the state complexities of basic operations for prefix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton (DFA) that accepts the language obtained from the operation. We know that a regular language is prefix-free if and o...
متن کاملState Complexity of Combined Operations for Prefix-Free Regular Languages
We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finitestate automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-int...
متن کاملComplexity of Prefix-Convex Regular Languages
A language L over an alphabet Σ is prefix-convex if, for any words x, y, z ∈ Σ, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefixclosed, and prefix-free languages. We study complexity properties of prefix-convex regular languages. In particular, we find the quotient/state complexity of boolean operations, product (concatenation), star, and reversal,...
متن کامل